An O(T3) algorithm for the capacitated lot sizing problem with minimum order quantities
نویسندگان
چکیده
منابع مشابه
An O(T3) algorithm for the capacitated lot sizing problem with minimum order quantities
This paper explores a single-item capacitated lot sizing problem with minimum order quantity, which plays the role of minor set-up cost. We work out the necessary and sufficient solvability conditions and apply the general dynamic programming technique to develop an O(T ) exact algorithm that is based on the concept of minimal sub-problems. An investigation of the properties of the optimal solu...
متن کاملParallel Genetic Algorithm for the Capacitated Lot-Sizing Problem
A parallel genetic algorithm is presented to solve the well-known ca-pacitated lot-sizing problem. The approach is implemented on a massively parallel single instruction multiple data architecture with 16384 4-bit processors. Based on a random keys representation a schedule is backward oriented obtained which enables us to apply a very simple capacity check. Genetic algorithms are a general pur...
متن کاملA polynomial time algorithm for the single-item lot sizing problem with capacities, minimum order quantities and dynamic time windows
This paper deals with the single-item capacitated lot sizing problem with concave production and storage costs, considering minimum order quantity and dynamic time windows. This problem models a lot sizing where the production lots are constrained in amount and frequency. In this problem, a demand must be satisfied at each period t over a planning horizon of T periods. This demand can be satisf...
متن کاملThe Linear Dynamic Lot Size Problem with Minimum Order Quantities
This paper continues the analysis of a special uncapacitated single item lot sizing problem where a minimum order quantity restriction, instead of the setup cost, guarantees a certain level of production lots. A detailed analysis of the model and an investigation of the particularities of the cumulative demand structure allowed us to develop a solution algorithm based on the concept of minimal ...
متن کاملCapacitated Lot-sizing with Linked Production Quantities of Adjacent Periods
One of the most important tasks operations manager are confronted with is to determine production quantities over a medium-size planning horizon such that demand is met, scarce production facilities are not overloaded and that the sum of holding and setup costs is minimized. For the single machine case the well-known Capacitated Lot-Sizing Problem (CLSP) has been proposed to determine minimum c...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: European Journal of Operational Research
سال: 2011
ISSN: 0377-2217
DOI: 10.1016/j.ejor.2011.01.007